- deterministic parser
- детерминированный синтаксический анализатор
English-Russian dictionary of computer science and programming. 2013.
deterministic parser
Смотреть что такое "deterministic parser" в других словарях:
Deterministic parsing — In natural language processing, deterministic parsing refers to parsing algorithms that do not back up. LR parsers are an example. (This meaning of the words deterministic and non deterministic differs from that used to describe nondeterministic… … Wikipedia
Deterministic context-free grammar — In formal grammar theory, the deterministic context free grammars (DCFGs) are a proper subset of the context free grammars. The deterministic context free grammars are those a deterministic pushdown automaton can recognize. A DCFG is the finite… … Wikipedia
Comparison of parser generators — This is a list of notable lexer generators and parser generators for various language classes. Contents 1 Regular languages 2 Deterministic context free languages 3 Parsing expression grammars, deterministic boolean grammars … Wikipedia
GLR parser — In computer science, a GLR parser ( Generalized Left to right Rightmost derivation parser ) is an extension of an LR parser algorithm to handle nondeterministic and ambiguous grammars. First described in a 1986 paper by Masaru Tomita, it has also … Wikipedia
LR parser — In computer science, an LR parser is a parser for context free grammars that reads input from Left to right and produces a Rightmost derivation. The term LR( k ) parser is also used; here the k refers to the number of unconsumed look ahead input… … Wikipedia
LF-Parser — Ein LF Parser (englisch strong LL parser) ist ein Top Down Parser, der ausschließlich auf der Grundlage der k nächsten Eingabe Token entscheidet, zu welcher Alternative ein Nichtterminalsymbol ersetzt wird. Von einem LL Parser unterscheidet… … Deutsch Wikipedia
Recursive ascent parser — In computer science, Non Deterministic Recursive Ascent Parsing is an implementation technique for bottom up parsers that uses mutually recursive functions instead of a stack automaton. This allows for a more functional, declarative… … Wikipedia
Gérard Sabah — (né le 5 janvier 1948 à Paris), est un chercheur français en intelligence artificielle. Sommaire 1 Formation et carrière 2 Domaines de recherche 3 Vie privée 4 … Wikipédia en Français
Ambiguous grammar — In computer science, a grammar is said to be an ambiguous grammar if there is some string that it can generate in more than one way (i.e., the string has more than one parse tree or more than one leftmost derivation). A language is inherently… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
SYNTAX — In computer science, SYNTAX is a system used to generate lexical and syntactic analyzers (parsers) (both deterministic and non deterministic) for all kind of context free grammars (CFGs) as well as some classes of contextual grammars. It is… … Wikipedia
